The Smallest Singular Value of a Random Rectangular Matrix Mark Rudelson and Roman Vershynin
نویسندگان
چکیده
We prove an optimal estimate of the smallest singular value of a random subgaussian matrix, valid for all dimensions. For an N × n matrix A with independent and identically distributed subgaussian entries, the smallest singular value of A is at least of the order √ N − √ n − 1 with high probability. A sharp estimate on the probability is also obtained.
منابع مشابه
Smallest Singular Value of a Random Rectangular Matrix
We prove an optimal estimate of the smallest singular value of a random subGaussian matrix, valid for all dimensions. For an N n matrix A with independent and identically distributed sub-Gaussian entries, the smallest singular value of A is at least of the order p N pn 1 with high probability. A sharp estimate on the probability is also obtained. © 2009 Wiley Periodicals, Inc.
متن کاملThe Smallest Singular Value of a Random Rectangular Matrix
We prove an optimal estimate on the smallest singular value of a random subgaussian matrix, valid for all fixed dimensions. For an N × n matrix A with independent and identically distributed subgaussian entries, the smallest singular value of A is at least of the order √ N − √ n − 1 with high probability. A sharp estimate on the probability is also obtained.
متن کاملTHE LEAST SINGULAR VALUE OF A RANDOM SQUARE MATRIX IS O(n) MARK RUDELSON AND ROMAN VERSHYNIN
Let A be a matrix whose entries are real i.i.d. centered random variables with unit variance and suitable moment assumptions. Then the smallest singular value sn(A) is of order n −1/2 with high probability. The lower estimate of this type was proved recently by the authors; in this note we establish the matching upper estimate.
متن کاملNon-asymptotic theory of random matrices: extreme singular values
The classical random matrix theory is mostly focused on asymptotic spectral properties of random matrices as their dimensions grow to infinity. At the same time many recent applications from convex geometry to functional analysis to information theory operate with random matrices in fixed dimensions. This survey addresses the non-asymptotic theory of extreme singular values of random matrices w...
متن کاملThe Littlewood-offord Problem and Invertibility of Random Matrices
We prove two basic conjectures on the distribution of the smallest singular value of random n×n matrices with independent entries. Under minimal moment assumptions, we show that the smallest singular value is of order n−1/2, which is optimal for Gaussian matrices. Moreover, we give a optimal estimate on the tail probability. This comes as a consequence of a new and essentially sharp estimate in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009